A time saving algorithm for the Monte Carlo method of Metropolis
نویسندگان
چکیده
A time saving algorithm for the Monte Carlo method of Metropolis is presented. The technique is tested with different potential models and number of particles. The coupling of the method with neighbor lists, linked lists, Ewald sum and reaction field techniques is also analyzed. It is shown that the proposed algorithm is particularly suitable for computationally heavy intermolecular potentials. © 2006 Elsevier B.V. All rights reserved. PACS: 02.50.Tt; 07.05.Tp
منابع مشابه
Metropolis Methods for Quantum Monte Carlo Simulations
Since its first description fifty years ago, the Metropolis Monte Carlo method has been used in a variety of different ways for the simulation of continuum quantum many-body systems. This paper will consider some of the generalizations of the Metropolis algorithm employed in quantum Monte Carlo: Variational Monte Carlo, dynamical methods for projector monte carlo (i.e. diffusion Monte Carlo wit...
متن کاملMarkov Chain Monte Carlo Methods in Statistical Physics
In this paper we shall briefly review a few Markov Chain Monte Carlo methods for simulating closed systems described by canonical ensembles. We cover both Boltzmann and non-Boltzmann sampling techniques. The Metropolis algorithm is a typical example of Boltzmann Monte Carlo method. We discuss the time-symmetry of the Markov chain generated by Metropolis like algorithms that obey detailed balanc...
متن کاملEconomic optimization of solar systems in uncertain economic conditions using the Monte Carlo method
Solar energy is an environmentally sustainable energy source as it is clean and inexhaustible. Solar systems are very common and cost-effective, thus, can be used for many home applications. In this paper, a new method is presented to optimize solar systems economically, regarding to energy cost fluctuations. In spite of conventional analyses, in which the inflation is considered constant, ...
متن کاملMonte Carlo Techniques for Bayesian Statistical Inference – A comparative review
In this article, we summariseMonte Carlo simulationmethods commonly used in Bayesian statistical computing. We give descriptions for each algorithm and provide R codes for their implementation via a simple 2-dimensional example. We compare the relative merits of these methods qualitatively by considering their general user-friendliness, and numerically in terms of mean squared error and computa...
متن کاملA Monte Carlo Metropolis-Hastings Algorithm for Sampling from Distributions with Intractable Normalizing Constants
Simulating from distributions with intractable normalizing constants has been a long-standing problem in machine learning. In this letter, we propose a new algorithm, the Monte Carlo Metropolis-Hastings (MCMH) algorithm, for tackling this problem. The MCMH algorithm is a Monte Carlo version of the Metropolis-Hastings algorithm. It replaces the unknown normalizing constant ratio by a Monte Carlo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Physics Communications
دوره 175 شماره
صفحات -
تاریخ انتشار 2006